optimizing a bi-objective preemptive multi-mode resource constrained project scheduling problem: nsga-ii and moica algorithms

Authors

javad hasanpour

quchan university of advanced technology mohammad ghodoosi

university of torbat-e heydarieh zahra sadat hosseini

k.n. toosi university of technology

abstract

the aim of a multi-mode resource-constrained project scheduling problem (mrcpsp) is to assign resource(s) with the restricted capacity to an execution mode of activities by considering relationship constraints, to achieve pre-determined objective(s). these goals vary with managers or decision makers of any organization who should determine suitable objective(s) considering organization strategies. we also introduce the preemptive extension of the problem which allows activity splitting. in this paper the preemption multi-mode resource-constrained project scheduling problem (p-mmrcpsp) with minimum makespan and the maximization of net present value (npv) has been considered. since the considered model is np-hard, the performance of our proposed model is evaluated by comparison with two well-known algorithms; non-dominated sorting genetic algorithm (nsga ii), multi-objective imperialist competitive algorithm (moica). these metaheuristics have been compared on the basis of a computational experiment performed on a set of instances obtained from standard test problems constructed by the progen project generator, where, additionally, cash flows were generated randomly with the uniform distribution. since the effectiveness of most meta-heuristic algorithms significantly depends on choosing the proper parameters. a taguchi experimental design method (doe) was applied to set and estimate the proper values of gas parameters for improving their performances. the computational results show that the proposed moica outperforms the nsga-ii.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Optimizing a bi-objective preemptive multi-mode resource constrained project scheduling problem: NSGA-II and MOICA algorithms

The aim of a multi-mode resource-constrained project scheduling problem (MRCPSP) is to assign resource(s) with the restricted capacity to an execution mode of activities by considering relationship constraints, to achieve pre-determined objective(s). These goals vary with managers or decision makers of any organization who should determine suitable objective(s) considering organization strategi...

full text

The Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem

This paper presents the formulation and solution of the Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem. The focus of the proposed method is not on finding a single optimal solution, instead on presenting multiple feasible solutions, with cost and duration information to the project manager. The motivation for developing such an approach is due in part to practica...

full text

A Bi-objective Pre-emption Multi-mode Resource Constrained Project Scheduling Problem with due Dates in the Activities

In this paper, a novel mathematical model for a preemption multi-mode multi-objective resource-constrained project scheduling problem with distinct due dates and positive and negative cash flows is presented. Although optimization of bi-objective problems with due dates is an essential feature of real projects, little effort has been made in studying the P-MMRCPSP while due dates are included i...

full text

Using Multi-Objective Particle Swarm Optimization for Bi-objective Multi-Mode Resource-Constrained Project Scheduling Problem

In this paper the multi-mode resource-constrained project scheduling problem with discounted cash flows is considered. Minimizing the makespan and maximization the net present value (NPV) are the two common objectives that have been investigated in the literature. We apply one evolutionary algorithm named multiobjective particle swarm optimization (MOPSO) to find Pareto front solutions. We used...

full text

the combinatorial multi-mode resource constrained multi-project scheduling problem

this paper presents the formulation and solution of the combinatorial multi-mode resource constrained multi-project scheduling problem. the focus of the proposed method is not on finding a single optimal solution, instead on presenting multiple feasible solutions, with cost and duration information to the project manager. the motivation for developing such an approach is due in part to practica...

full text

Multi-Objective Multi-Mode Resource-Constrained Project Scheduling Problem by Preemptive Fuzzy Goal Programming

This research proposes a preemptive fuzzy goal programming model for multi-objective multi-mode resource constrained project scheduling problem. The objectives of the problem are minimization of the total time and the total cost of the project. Objective in a multi-mode resource-constrained project scheduling problem is often a minimization of makespan. However, both time and cost should be con...

full text

My Resources

Save resource for easier access later


Journal title:
journal of optimization in industrial engineering

جلد ۱۰، شماره ۲۱، صفحات ۷۹-۹۲

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023